package algorithm.leetcode.I1400above;

/**
 * 没什么意思
 */

public class Q1486 {

    public int xorOperation(int n, int start) {
        int res = start;
        for (int i = 1; i < n; i++) {
            res ^= (start + 2*i);
        }
        return res;
    }

}
